On the threshold of spread-out voter model percolation
نویسندگان
چکیده
منابع مشابه
Spread-out percolation
Fix d ≥ 2, and let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spread-out’ percolation model studied by Penrose [8], who showed that, as r → ∞, the average degree of the corresponding random graph at the percolation threshold tends...
متن کاملSpread-out percolation in R
Fix d ≥ 2, and let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spread-out’ percolation model studied by Penrose [8], who showed that, as r →∞, the average degree of the corresponding random graph at the percolation threshold tends ...
متن کاملthe effect of using model essays on the develpment of writing proficiency of iranina pre-intermediate efl learners
abstract the present study was conducted to investigate the effect of using model essays on the development of writing proficiency of iranian pre-intermediate efl learners. to fulfill the purpose of the study, 55 pre- intermediate learners of parsa language institute were chosen by means of administering proficiency test. based on the results of the pretest, two matched groups, one as the expe...
a study on insurer solvency by panel data model: the case of iranian insurance market
the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.
Continuum Percolation with Unreliable and Spread-Out Connections
We derive percolation results in the continuum plane that lead to what appears to be a general tendency of many stochastic network models. Namely, when the selection mechanism according to which nodes are connected to each other, is sufficiently spread out, then a lower density of nodes, or on average fewer connections per node, are sufficient to obtain an unbounded connected component. We look...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2017
ISSN: 1083-589X
DOI: 10.1214/17-ecp80